Multi-adjoint Logic Programming with Continuous Semantics
نویسندگان
چکیده
Considering different implication operators, such as Lukasiewicz, Gödel or product implication in the same logic program, naturally leads to the allowance of several adjoint pairs in the lattice of truthvalues. In this paper we apply this idea to introduce multi-adjoint logic programs as an extension of monotonic logic programs. The continuity of the immediate consequences operators is proved and the assumptions required to get continuity are further analysed.
منابع مشابه
A Completeness Theorem for Multi-Adjoint Logic Programming
Multi-adjoint logic programs generalise monotonic and residuated logic programs [2] in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. As our approach has continuous fixpoint semantics, in this work, a procedural semantics is given for the paradigm of multi-adjoint logic programming and a completeness result is proved. Some ap...
متن کاملMulti-Adjoint Logic Programming
A synthesis of results of the recently introduced paradigm of multi-adjoint logic programming is presented. These results range from a proof theory together with some (quasi)completeness results to general termination results, and from the neural-like implementation of its fix-point semantics to the more general biresiduated multi-adjoint logic programming and its relationship with other approa...
متن کاملA Procedural Semantics for Multi-adjoint Logic Programming
Multi-adjoint logic program generalise monotonic logic programs introduced in [1] in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. In this work, a procedural semantics is given for the paradigm of multiadjoint logic programming and completeness theorems are proved.
متن کاملA termination theorem for sorted multi-adjoint logic programming
The structure of the paper is as follows. In Section 2, we introduce the preliminary concepts necessary for the definition of the syntax and semantics of sorted multi-adjoint logic programs, presented in Section 3. In Section 4, we state the basic results regarding the termination properties of our semantics, which are extended later in Section 5. The paper finishes with some conclusions and po...
متن کاملBiresiduated Multi-Adjoint Logic Programming
Multi-adjoint logic programs were recently proposed as a generalisation of monotonic and residuated logic programs introduced, in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. In this work, the possible existence of biresiduated pairs is considered, later, on the resulting framework of biresiduated multi-adjoint logic progra...
متن کامل